Finding Optimal Solutions for Voting Game Design Problems

Finding Optimal Solutions for Voting Game Design Problems

In many circumstances where multiple agents need to make a joint decision, voting is used to aggregate the agents’ preferences. Each agent’s vote carries a weight, and if the sum of the weights of the agents in favor of some outcome is larger than or equal to a given quota, then this outcome is decided upon. The distribution of weights leads to a certain distribution of power. Several ‘power in...

Finding Optimal Solutions to Cooperative Pathfinding Problems

In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first practical, admissible, and complete algorithm for solving problems of this kind. First, we propose a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms...

Finding optimal solutions for covering and matching problems

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

Game Theoretic Problems in Network Economics and Mechanism Design Solutions

Mechanism Design is the art and science of designing rules of a game to achieve a specific outcome; mechanism design is the reverse engineering of games. It has been successfully applied to a variety of high impact problems in Internet and network economics: Internet advertising, spectrum auctions, electronic procurement, logistics, supply chain management, grid computing, wireless networks, pe...